Radar Task Schedulers based on Multiple Queue
نویسندگان
چکیده
There are very complex communication systems, as the multifunction radar, MFAR (Multi-Function Array Radar), where functions are integrated all together, and simultaneously are performed the classic functions of tracking and surveillance, as all the functions related to the communication, countermeasures, and calibration. All these functions are divided into the tasks to execute. The task scheduler is a key element of the radar, since it does the planning and distribution of energy and time resources to be shared and used by all tasks. This paper presents schedulers based on the use of multiple queue. Several schedulers have been designed and studied, and it has been made a comparative analysis of different performed schedulers. The tests and experiments have been done by means of system software simulation. Finally a suitable set of radar characteristics has been selected to evaluate the behavior of the task scheduler working. Keywords—Queue Theory, Radar, Scheduler, Task.
منابع مشابه
A Relative Study on Task Schedulers in Hadoop MapReduce
Hadoop is a framework for BigData processing in distributed applications. Hadoop cluster is built for running data intensive distributed applications. Hadoop distributed file system is the primary storage area for BigData. MapReduce is a model to aggregate tasks of a job. Task assignment is possible by schedulers. Schedulers guarantee the fair allocation of resources among users. When a user su...
متن کاملOn the efficacy, efficiency and emergent behavior of task replication in large distributed systems
Large distributed systems challenge traditional schedulers, as it is often hard to determine a priori how long each task will take to complete on each resource, information that is input for such schedulers. Task replication has been applied in a variety of scenarios as a way to circumvent this problem. Task replication consists of dispatching multiple replicas of a task and using the result fr...
متن کاملA Lookback Scheduling Framework for Long-Term Quality-of-Service Over Multiple Cells
In current cellular networks, schedulers allocate wireless channel resources to users based on instantaneous channel gains and short-term moving averages of user rates and queue lengths. By using only such short-term information, schedulers ignore the users’ service history in previous cells and, thus, cannot guarantee long-term Quality of Service (QoS) when users traverse multiple cells with v...
متن کاملEagle job-aware scheduling: divide and ... reorder
We present Eagle, a new hybrid cluster scheduler for data-parallel programs, consisting of a centralized scheduler for long jobs and a set of distributed schedulers for short jobs. Eagle incorporates two new techniques: succinct state sharing and sticky batch probing. With succinct state sharing, the centralized scheduler informs the distributed schedulers of the placement of long jobs in a low...
متن کاملHadoop Scheduling Base On Data Locality
In hadoop, the job scheduling is an independent module, users can design their own job scheduler based on their actual application requirements, thereby meet their specific business needs. Currently, hadoop has three schedulers: FIFO, computing capacity scheduling and fair scheduling policy, all of them are take task allocation strategy that considerate data locality simply. They neither suppor...
متن کامل